Largest dual ellipsoids inscribed in dual cones

نویسنده

  • Michael J. Todd
چکیده

Suppose x̄ and s̄ lie in the interiors of a cone K and its dual K∗ respectively. We seek dual ellipsoidal norms such that the product of the radii of the largest inscribed balls centered at x̄ and s̄ and incribed in K and K∗ respectively is maximized. Here the balls are defined using the two dual norms. We provide a solution when the cones are symmetric, that is self-dual and homogeneous. This provides a geometric justification for the Nesterov-Todd primal-dual scaling in symmetric cone programming. School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York 14853, USA ([email protected]). This author was supported in part by NSF through grant DMS-0209457 and ONR through grant N00014-02-1-0057.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial Primal Dual Cone Affine Scaling for Semidefinite Programming

Semide nite programming concerns the problem of optimizing a linear function over a section of the cone of semide nite matrices In the cone a ne scaling approach we replace the cone of semide nite matrices by a certain inscribed cone in such a way that the resulting optimization problem is analytically solvable The now easily obtained solution to this modi ed problem serves as an approximate so...

متن کامل

Cones of ball-ball separable elements

Let B1, B2 be balls in finite-dimensional real vector spaces E1, E2, centered around unit length vectors v1, v2 and not containing zero. An element in the tensor product space E1 ⊗ E2 is called B1 ⊗B2-separable if it is contained in the convex conic hull of elements of the form w1 ⊗w2, where w1 ∈ B1, w2 ∈ B2. We study the cone formed by the separable elements in E1⊗E2. We determine the largest ...

متن کامل

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

Algorithm for finding the largest inscribed rectangle in polygon

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...

متن کامل

On improved Choi-Goldfarb solution-containing ellipsoids in linear programming

Ellipsoids that contain all optimal primal solutions, those that contain all optimal dual slack solutions, and primal– dual ellipsoids are derived. They are independent of the algorithm used and have a smaller size than the Choi–Goldfarb ellipsoids [J. Optim. Theory Appl. 80 (1994) 161–173]. c © 2000 Elsevier Science B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 117  شماره 

صفحات  -

تاریخ انتشار 2009